The Differential Dimension Polynomial for Characterizable Differential Ideals
نویسنده
چکیده
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it decides equality of characterizable differential ideals contained in each other.
منابع مشابه
Universal characteristic decomposition of radical differential ideals
We call a differential ideal universally characterizable, if it is characterizable w.r.t. any ranking on partial derivatives. We propose a factorization-free algorithm that represents a radical differential ideal as a finite intersection of universally characterizable ideals. The algorithm also constructs a universal characteristic set for each universally characterizable component, i.e., a fin...
متن کاملm at h . A C ] 1 6 Fe b 20 07 Bounds for algorithms in differential algebra 1
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
متن کاملBounds for algorithms in differential algebra
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
متن کاملA bound for the Rosenfeld-Gröbner algorithm
We consider the Rosenfeld–Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld–Gröbner algorithm, in whic...
متن کاملA Bound for Rosenfeld-Gröbner Algorithm
We consider the Rosenfeld-Gröbner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials F , let M(F ) be the sum of maximal orders of differential indeterminates occurring in F . We propose a modification of the Rosenfeld-Gröbner algorithm, in whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.5959 شماره
صفحات -
تاریخ انتشار 2014